#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <map>
#include <climits>


using namespace std;


struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode() : val(0), left(nullptr), right(nullptr) {}
    TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
    TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};



class Solution {
public:
    TreeNode* helper(vector<int>& nums,int l,int r){
        if(l>r){
            return nullptr;
        }
        int mx=INT_MIN,mxi=0;
        for(int i=l;i<=r;i++){
            if(nums[i]>mx){
                mxi=i;
                mx=nums[i];
            }
        }
        TreeNode *root=new TreeNode(mx);
        root->left=helper(nums,l,mxi-1);
        root->right=helper(nums,mxi+1,r);
        return root;
    }
    TreeNode* constructMaximumBinaryTree(vector<int>& nums) {
        return helper(nums,0,nums.size()-1);
    }
};



int main(){




    return 0;
}